Characterization of networks supporting multi-dimensional linear interval routing schemes
نویسندگان
چکیده
منابع مشابه
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
An Interval Routing Scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The interval assigned to a link e at a node v indicates the set of destination addresses of the messages which should be forwarded through e ...
متن کاملCharacterization of Networks Supporting Multi-dimensional Linear Interval Routing Scheme
An Interval routing scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The interval assigned to a link e at a node v indicates the set of destination addresses of the messages which should be forwarded through e ...
متن کاملMulti-Dimensional Interval Routing Schemes
Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multi-dimensional case hk; di-MIRS, where k is the number of intervals and d is the number of dimensions. Whereas k...
متن کاملMulti-dimensional Interval Routing Schemes
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-eÆcient routing strategy for routing messages in a network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The interval assigned to a link l at a no...
متن کاملOn Multi-Label Linear Interval Routing Schemes
We consider linear interval routing schemes studied by [3, 5] from a graph-theoretic perspective. We examine how the number of linear intervals needed to obtain shortest path routings in networks is affected by the product, join and composition operations on graphs. This approach allows us to generalize some of the results of [3, 5] concerning the minimum number of intervals needed to achieve s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.06.013